#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read()
{
	LL x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    if(n==1) cout<<"9"<<endl;
    else if(n==2) cout<<"98"<<endl;
    else if(n==3) cout<<"989"<<endl;
    else{
        cout<<"989";
        LL cnt=(n-3)/10;
        LL mod=(n-3)%10;
   /// debug(mod);
        for(LL i=1;i<=cnt;i++){
            cout<<"0123456789";
        }
        for(LL i=0;i<mod;i++){
            cout<<char('0'+i);
        }
        cout<<endl;
    }
  }
return 0;
}
